Millikan’s Isomorphism Requirement
نویسنده
چکیده
Introduction Millikan’s theory of content places great reliance on the existence of isomorphisms between a system of representations and the things in the world which they represent — “the mapping requirement for being intentional signs” (Millikan 2004, p. 106). This paper asks whether those isomorphisms are doing any substantive explanatory work. Millikan’s isomorphism requirement is deployed for two main purposes. First, she claims that the existence of an isomorphism is the basic representing relation, with teleology playing a subsidiary role — to account for misrepresentation (the possibility of error). Second, Millikan relies on an isomorphism requirement in order to guarantee that a system of representations displays a kind of productivity. This seemingly strong reliance on isomorphism has prompted the objection that isomorphism is too liberal to be the basic representing relation: there are isomorphisms between any system of putative representations and any set, of the same cardinality, of items putatively represented. This paper argues that all the work in fixing content is in fact done by the teleology. Deploying Millikan’s teleology-based conditions to ascribe contents will ensure that there is an isomorphism between representations and the things they represent, but the isomorphism ‘requirement’ is playing no substantive explanatory role in Millikan’s account of content determination. So an objection to her theory based on the liberality of isomorphism is misplaced. The second role for isomorphism is to account for productivity. If some kind of productivity is indeed necessary for representation, then functional isomorphism will again be too liberal a constraint to account for that feature. The paper suggests an alternative way of specifying the relation between a system of representations and that which they represent which is capable of playing an explanatory role in accounting for Millikan’s type of productivity. In short, the liberality of isomorphism is no objection to Millikan’s teleosemantics, since the isomorphism ‘requirement’ need play no independent substantive role in Millikan’s account of representation.
منابع مشابه
- 1 - Finding Order in our World :
We discuss neuroscientific and phenomenological arguments in support of Millikan’s thesis. Then we consider invariance as a unifying theme in perceptual and conceptual tracking, and how invariants may be extracted from the environment. Finally we consider some wider implications of Millikan’s nondescriptionist approach to language, with especial application to color terms. Since I am in substan...
متن کاملBuilding a Science of Teaching Physics
Individual teachers of college level physics sometimes develop deep insights into how their students learn and what elements of classroom instruction are valuable in facilitating the learning process. Yet these insights rarely persist beyond the individual instructor. Educational methods seem to cycle from one fad to another, rarely cumulating increasingly powerful knowledge in the way scientis...
متن کاملBidirectional Collision Detection and Faster Deterministic Isomorphism Testing
In this work, we introduce bidirectional collision detection — a new algorithmic tool that applies to the collision problems that arise in many isomorphism problems. For the group isomorphism problem, we show that bidirectional collision detection yields a deterministic n logn+O(1) time algorithm whereas previously the n generator-enumeration algorithm was the best result for several decades. F...
متن کاملOn Isomorphism Theorems of Fn -Polygroups
In this paper, the notion of fuzzy n-polygroups (Fn -polygroups) is introduced and some related properties are investigated. In this regards, the concepts of normal F-subpolygroups and homomorphisms of Fn-polygroups are adopted. Also, the quotient of Fn-polygroups by defining regular relations are studied. Finally, the classical isomorphism theorems of groups are generalized to Fn-polygroups p...
متن کاملGraph Isomorphism and the Lasserre Hierarchy
In this paper we show lower bounds for a certain large class of algorithms solving the Graph Isomorphism problem, even on expander graph instances. Spielman [25] shows an algorithm for isomorphism of strongly regular expander graphs that runs in time exp{Õ(n 13 )} (this bound was recently improved to exp{Õ(n 15 )} [5]). It has since been an open question to remove the requirement that the graph...
متن کامل